A Partial Order in the Knot Table
نویسندگان
چکیده
Let K be a prime knot and G(K) its knot group. It is well known that a partial order can be defined on the set of prime knots as follows: for two knots K1,K2, we write K1 ≥ K2 if there exists a surjective group homomorphism from G(K1) onto G(K2). In this paper, we determine this partial order “≥” on the set of knots in Rolfsen’s knot table, which lists all the prime knots of ten crossings or less. Theorem 1.1 is the main result of this paper. The numbering of the knots follows that of Rolfsen’s book [Rolfsen 03].
منابع مشابه
Twisted Alexander invariant and a partial order in the knot table
Twisted Alexander invariant is defined for a finitely presentable group G and a representation of G and a surjective homomorphism of G to a free abelian group. In this talk, we introduce some examples and some properties of the twisted Alexander invariant. Moreover, as an application, we consider a partial order on the set of prime knots. Let K be a knot and G(K) the knot group. For two prime k...
متن کاملOn the Fischer-Clifford matrices of a maximal subgroup of the Lyons group Ly
The non-split extension group $overline{G} = 5^3{^.}L(3,5)$ is a subgroup of order 46500000 and of index 1113229656 in Ly. The group $overline{G}$ in turn has L(3,5) and $5^2{:}2.A_5$ as inertia factors. The group $5^2{:}2.A_5$ is of order 3 000 and is of index 124 in L(3,5). The aim of this paper is to compute the Fischer-Clifford matrices of $overline{G}$, which together with associated parti...
متن کاملKnot Theory from a Chern - Simons Gauge Theory
A brief summary of the development of perturbative Chern-Simons gauge theory related to the theory of knots and links is presented. Emphasis is made on the progress achieved towards the determination of a general combinatorial expression for Vassiliev invariants. Its form for all the invariants up to order four is reviewed, and a table of their values for all prime knots with ten crossings is p...
متن کاملThe Class of Constraint Satisfaction Problems over a Knot
This work presents a method for associating a class of constraint satisfaction problems to a three-dimensional knot. Given a knot, one can build a knot quandle, which is a generally an infinite, free algebra. The desired collection of problems is derived from the finite quotients of the knot quandle by applying theory that relates finite algebras to constraint languages. Along the way, notions ...
متن کاملA Partial Ordering of Knots Through Diagrammatic Unknotting
In this paper we define a partial order on the set of all knots and links using a special property derived from their minimal diagrams. A knot or link K′ is called a predecessor of a knot or link K if Cr(K′) < Cr(K) and a diagram of K′ can be obtained from a minimal diagram D of K by a single crossing change. In such a case we say that K′ < K. We investigate the sets of knots that can be obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Experimental Mathematics
دوره 14 شماره
صفحات -
تاریخ انتشار 2005